Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees

نویسندگان

چکیده

For a graph property $$\varPi $$ , Subgraph Complementation to is the problem find whether there subset S of vertices input G such that modifying by complementing subgraph induced results in satisfying . We prove T-free graphs NP-Complete, for T being tree, except 41 trees at most 13 (a if it does not contain any copies T). This result, along with 4 known polynomial-time solvable cases (when path on vertices), leaves behind 37 open cases. Further, we these hard problems do admit subexponential-time algorithms, assuming Exponential Time Hypothesis. As an additional obtain paw-free can be solved polynomial-time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Playing Dominoes Is Hard, Except by Yourself

Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that singleplayer dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players c...

متن کامل

Pathwidth is NP-Hard for Weighted Trees

The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for particular subclasses of chordal graphs, and we deduce that the problem remains hard for weighted trees. We also discuss subclasses of chordal graphs for which the problem is polynomial.

متن کامل

Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern

The kTree problem is a special case of Subgraph Isomorphism where the pattern graph is a tree, that is, the input is an n-node graph G and a k-node tree T , and the goal is to determine whether G has a subgraph isomorphic to T . We provide evidence that this problem cannot be computed significantly faster than 2poly(n), which matches the fastest algorithm known for this problem [ICALP 2009 and ...

متن کامل

Hard Graphs for Randomized Subgraph Exclusion Algorithms

A randomized version of the Clique approximation algorithm by Boppana and Halldd orsson is analyzed. The Boppana Halldd orsson algorithm is currently the only approximation algorithm for the Clique problem with a non-trivial performance guarantee. This paper presents a class of graphs on which the performance ratio of the randomized version of the algorithm is not better than (p n) with probabi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-20624-5_1